Symmetric Min-Max Heap: A Simpler Data Structure for Double-Ended Priority Queue

Several data structures have been proposed to implement double-ended priority queue operations in O(log n) time, e.g., Min-Max heap [ 11, Deap [2], Diamond deque [3] and back-to-back heap [4]. In MinMax heaps, the even layers form a Min-heap and the odd layers form a Max-heap. Deap has separate Minheaps and Max-heaps that are built on the left and right subtrees, respectively. In Diamond deque, the Minheap and Max-heap are not separable. The separation of the Minand Max-heaps in [l] and [2] tend to make computations complicated. The